The Relationships Between Chebyshev, Legendre and Jacobi Polynomials: The Generic Superiority of Chebyshev Polynomials and Three Important Exceptions
نویسندگان
چکیده
We analyze the asymptotic rates of convergence of Chebyshev, Legendre and Jacobi polynomials. One complication is that there are many reasonable measures of optimality as enumerated here. Another is that there are at least three exceptions to the general principle that Chebyshev polynomials give the fastest rate of convergence from the larger family of Jacobi polynomials. When f (x) is singular at one or both endpoints, all Gegenbauer polynomials (including Legendre and Chebyshev) converge equally fast at the endpoints, but Gegenbauer polynomials converge more rapidly on the interior with increasing order m. For functions on the surface of the sphere, associated Legendre functions, which are proportional to Gegenbauer polynomials, are best for the latitudinal dependence. Similarly, for functions on the unit disk, Zernike polynomials, which are Jacobi polynomials in radius, are superior in rate-of-convergence to a Chebyshev–Fourier series. It is true, as was conjectured by Lanczos 60 years ago, that excluding these exceptions, the Chebyshev coefficients an usually decrease faster than the Legendre coefficients bn by a factor of √ n. We calculate the proportionality constant for a few examples and restrictive classes of functions. The more precise claim that bn ∼ √π/2√nan , made by Lanczos and later Fox and Parker, is true only for rather special functions. However, individual terms in the large n asymptotics of Chebyshev and Legendre coefficients usually do display this proportionality.
منابع مشابه
The coefficients of differentiated expansions of double and triple Jacobi polynomials
Formulae expressing explicitly the coefficients of an expansion of double Jacobi polynomials which has been partially differentiated an arbitrary number of times with respect to its variables in terms of the coefficients of the original expansion are stated and proved. Extension to expansion of triple Jacobi polynomials is given. The results for the special cases of double and triple ultraspher...
متن کاملSolving the fractional integro-differential equations using fractional order Jacobi polynomials
In this paper, we are intend to present a numerical algorithm for computing approximate solution of linear and nonlinear Fredholm, Volterra and Fredholm-Volterra integro-differential equations. The approximated solution is written in terms of fractional Jacobi polynomials. In this way, firstly we define Riemann-Liouville fractional operational matrix of fractional order Jacobi polynomials, the...
متن کاملA spectral method based on the second kind Chebyshev polynomials for solving a class of fractional optimal control problems
In this paper, we consider the second-kind Chebyshev polynomials (SKCPs) for the numerical solution of the fractional optimal control problems (FOCPs). Firstly, an introduction of the fractional calculus and properties of the shifted SKCPs are given and then operational matrix of fractional integration is introduced. Next, these properties are used together with the Legendre-Gauss quadrature fo...
متن کاملGeneralizations and Specializations of Generating Functions for Jacobi, Gegenbauer, Chebyshev and Legendre Polynomials with Definite Integrals
In this paper we generalize and specialize generating functions for classical orthogonal polynomials, namely Jacobi, Gegenbauer, Chebyshev and Legendre polynomials. We derive a generalization of the generating function for Gegenbauer polynomials through extension a two element sequence of generating functions for Jacobi polynomials. Specializations of generating functions are accomplished throu...
متن کاملCollocation Method via Jacobi Polynomials for Solving Nonlinear Ordinary Differential Equations
We extend a collocation method for solving a nonlinear ordinary differential equation ODE via Jacobi polynomials. To date, researchers usually use Chebyshev or Legendre collocation method for solving problems in chemistry, physics, and so forth, see the works of Doha and Bhrawy 2006, Guo 2000, and Guo et al. 2002 . Choosing the optimal polynomial for solving every ODEs problem depends on many f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Sci. Comput.
دوره 59 شماره
صفحات -
تاریخ انتشار 2014